Systolic Routing in an Optical Fat Tree
نویسنده
چکیده
In this paper we present an all-optical network architecture and a systolic routing protocol for it. An -dimensional optical fat tree network ( ) consists of routing nodes and processing nodes deployed at the leaf nodes of the network. In our construction packets injected into the carry no routing information. Routing is based on the use of a cyclic control bit sequence and scheduling. The systolic routing protocol ensures that no electro-optical conversion is needed in the intermediate routing nodes and all the packets injected into the routing machinery will reach their target without collisions. A work-optimal routing of an -relation is achieved with a reasonable size of .
منابع مشابه
Systolic Routing in an Optical Ring with Logarithmic Shortcuts
We present an all-optical ring network architecture with logarithmic shortcuts and a systolic routing protocol for it. An r-dimensional optical ring network with logarithmic shortcuts (ORLS) consists of n = 2 nodes and r2 optical links. We study a systolic routing protocol that is based on cyclic changes of the states of routers and scheduled sendings of packets. The protocol ensures that no el...
متن کاملSystolic Routing in Sparse Optical Torus
In this paper we present an all-optical network architecture and a systolic routing protocol for it. The sparse optical torus network consists of an n×n torus, where processors are deployed diagonally. The systolic routing protocol ensures that no electro-optical conversion is needed in the intermediate routing nodes and all the packets injected into the routing machinery will reach their targe...
متن کاملA Metaheuristic Algorithm for the Minimum Routing Cost Spanning Tree Problem
The routing cost of a spanning tree in a weighted and connected graph is defined as the total length of paths between all pairs of vertices. The objective of the minimum routing cost spanning tree problem is to find a spanning tree such that its routing cost is minimum. This is an NP-Hard problem that we present a GRASP with path-relinking metaheuristic algorithm for it. GRASP is a multi-start ...
متن کاملSystolic Routing in an Optical Butterfly
In this paper we present an all-optical network architecture and a systolic routing protocol for it. The -dimensional optical butterfly ( ) network consists of nodes and edges. Processors are deployed at the level 0 (identical to level ) nodes of the network. Routing is based on the use of a cyclic control bit sequence and scheduling. The systolic routing protocol ensures that no electrooptical...
متن کاملTraffic-Modeling-Based Design and Evaluation of a Hybrid Electro-Optical Intra-Data Center Network
The paper is dealing with the analysis, design and performance evaluation of a hybrid electro-optical Intra-Data Center Network, based on the Long-Range Dependence (LRD) traffic-generation model, as well as the so called “Fat-Tree” architecture. A thorough simulation of the data generation at Server level is performed, followed by the aggregation of data streams at the Top-of-Rack, Aggregation ...
متن کامل